#define _CRT_SECURE_NO_WARNINGS 1

//https://leetcode.cn/problems/container-with-most-water/

//class Solution {
//public:
//    int maxArea(vector<int>& height) {
//        int left = 0, right = height.size() - 1, ret = 0;
//        while (left < right)
//        {
//            ret = max(ret, min(height[left], height[right]) * (right - left));
//            if (height[left] < height[right])
//                ++left;
//            else
//                --right;
//        }
//        return ret;
//    }
//};